Lecture 6 : Set Membership , Applications of k - wise Independence
نویسندگان
چکیده
Given that we want a 1-bit query data structure, the querying algorithm basically suggests itself. Consider a bipartite graph G, whose pieces L and R stand for the Universe and Memory bits, respectively (so |L| = m). Based on the input set S ⊆ L, for every vertex of R we decide whether to write either 0 or 1 on it. Then given a query x ∈ L, we pick a random neighbor y of x and output “x ∈ S” if and only if a 1 is written on y.
منابع مشابه
Lecture 5: k-wise Independent Hashing and Applications
If the random variables X1, X2, · · · , Xn are independent, they are k-wise independent for any k. However, the converse is not true as shown by the following example. Also, if k1 > k2, k1-wise independence implies k2-wise independence. Example 2. Let X1, X2 be uniform independent random variables taking values in {0, 1}. Let X3 = X1 ⊕X2. It is easy to check that {X1, X2, X3} is pairwise indepe...
متن کاملA Derandomization Using Min-Wise Independent Permutations
Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate min-wise independence allows similar uses, by presenting a derandomization of the RNC algorithm for approximate set cover due to S. Rajagopalan and V. Vazirani. We also ...
متن کاملLecture 8 : Applications of Small - Bias Generators
In the previous lecture, we developed the basics of harmonic analysis and used them to quantitatively show that every small-bias generator is almost k-wise uniform. This led to an -PRG for k-wise uniformity with seed length O(k + log(1/ ) + log r), where r denotes the output length. In this lecture we give a construction that improves the dependence on r to O(log log r), and for this we again u...
متن کاملBounded Indistinguishability and the Complexity of Recovering Secrets
Motivated by cryptographic applications, we study the notion of bounded indistinguishability, a natural relaxation of the well studied notion of bounded independence. We say that two distributions μ and ν over Σ are k-wise indistinguishable if their projections to any k symbols are identical. We say that a function f : Σ → {0, 1} is -fooled by k-wise indistinguishability if f cannot distinguish...
متن کاملMeasuring k-Wise Independence of Streaming Data under L2 Norm
Measuring independence and k-wise independence is a fundamental problem that has multiple applications and it has been the subject of intensive research during the last decade (see, among others, the recent work of Batu, Fortnow, Fischer, Kumar, Rubinfeld and White [11] and of Alon, Andoni, Kaufman, Matulef, Rubinfeld and Xie [2] ). In the streaming environment, this problem was first addressed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013